A Robust Parser for Unrestricted Greek Text
نویسندگان
چکیده
In this paper we describe a method for the efficient parsing of real-life Greek texts at the surface syntactic level. A grammar consisting of non-recursive regular expressions describing Greek phrase structure has been compiled into a cascade of finite state transducers used to recognize syntactic constituents. The implemented parser lends itself to applications where large scale text processing is involved, and fast, robust, and relatively accurate syntactic analysis is necessary. The parser has been evaluated against a ca 34000 word corpus of financial and news texts and achieved promising precision and recall scores.
منابع مشابه
A Block-Based Robust Dependency Parser For Unrestricted Chinese Text
Although substantial efforts have been made to parse Chinese, very few have been practically used due to incapability of handling unrestricted texts. This paper realizes a practical system for Chinese parsing by using a hybrid model of phrase structure partial parsing and dependency parsing. This system showed good performance and high robustness in parsing unrestricted texts and has been appli...
متن کاملAPOLN: A Partial Parser Of Unrestricted Text
In this paper, we present APOLN (Analizador Parcial de Oraciones en Lenguaje Natural): a partial parser of unrestricted natural language sentences based on finite-state techniques. Partial parsing has been used in several applications: syntactic parsing of unrestricted texts, data extraction systems, machine translation, solving the attachment ambiguity, speech recognition systems, text summari...
متن کاملLHIP: Interpreting Extended DCGs for Applied Grammar Development
This paper describes LHIP (Left-Head corner Island Parser), a parser designed for broadcoverage handling of unrestricted text. The system interprets an extended DCG formalism to produce a robust analyser that nds parses of the input made from \islands" of terminals (corresponding to terminals consumed by successful grammar rules). It is currently in use for processing dialogue transcripts from ...
متن کاملIncrementality In Deterministic Dependency Parsing
Deterministic dependency parsing is a robust and efficient approach to syntactic parsing of unrestricted natural language text. In this paper, we analyze its potential for incremental processing and conclude that strict incrementality is not achievable within this framework. However, we also show that it is possible to minimize the number of structures that require nonincremental processing by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000